Learning Convex Optimization Models
نویسندگان
چکیده
A convex optimization model predicts an output from input by solving a problem. The class of models is large, and includes as special cases many well-known like linear logistic regression. We propose heuristic for learning the parameters in given dataset input-output pairs, using recently developed methods differentiating solution problem with respect to its parameters. describe three general classes models, maximum posteriori (MAP) utility maximization agent present numerical experiment each.
منابع مشابه
Convex Optimization Models: An Overview
1.1. Lagrange Duality . . . . . . . . . . . . . . . . . . p. 2 1.1.1. Separable Problems – Decomposition . . . . . . . p. 7 1.1.2. Partitioning . . . . . . . . . . . . . . . . . . p. 9 1.2. Fenchel Duality and Conic Programming . . . . . . . . p. 10 1.2.1. Linear Conic Problems . . . . . . . . . . . . . p. 15 1.2.2. Second Order Cone Programming . . . . . . . . . p. 17 1.2.3. Semidefinite Progr...
متن کاملOrbit Learning using Convex Optimization
Recently, learning approaches have been brought to bear on nonlinear datasets by assuming samples lie on a low-dimensional Riemannian manifold in the embedding space. One solution is to model local variations linearly [1]. A fundamental difficulty with such solutions is they cannot extrapolate or generalize far from the training data when the manifold is curved. Consequently, the manifold needs...
متن کاملEstimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user’s original query with additional related words. Current algorithms for automatic query expansion can often improve retrieval accuracy on average, but are not robust: that is, they are highly unstable and have poor worst-case performance for individual queries. To address this problem, we intro...
متن کاملBounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the procedural model. Then we present a novel algorithm that expresses the IFS-bounding problem as a set of linear constraints on a linear objective function, which can then be solved via standard techniques for linear conve...
متن کاملActive Learning as Non-Convex Optimization
We propose a new view of active learning algorithms as optimization. We show that many online active learning algorithms can be viewed as stochastic gradient descent on non-convex objective functions. Variations of some of these algorithms and objective functions have been previously proposed without noting this connection. We also point out a connection between the standard min-margin offline ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/CAA Journal of Automatica Sinica
سال: 2021
ISSN: ['2329-9274', '2329-9266']
DOI: https://doi.org/10.1109/jas.2021.1004075